Regularization networks: fast weight calculation via Kalman filtering
نویسندگان
چکیده
منابع مشابه
Distributed Kalman filtering via node selection in heterogeneous sensor networks
Donato Di Paola, Antonio Petitti, Alessandro Rizzo ∗ Institute of Intelligent Systems for Automation (ISSIA), National Research Council (CNR), 70126 Bari, Italy; Dipartimento di Ingegneria Elettrica e dell’ Informazione (DEI), Politecnico di Bari, 70126 Bari, Italy Department of Mechanical and Aerospace Engineering, New York University Polytechnic School of Engineering, Six MetroTech Center, Br...
متن کاملKalman Filtering and Neural Networks
Designations used by companies to distinguish their products are often claimed as trademarks. In all instances where John Wiley & Sons, Inc., is aware of a claim, the product names appear in initial capital or ALL CAPITAL LETTERS. Readers, however, should contact the appropriate companies for more complete information regarding trademarks and registration. This publication is designed to provid...
متن کاملGPS Precise Absolute Positioning via Kalman Filtering
Applied Research Laboratories, The University of Texas at Austin (ARL:UT), under sponsorship of the National Geospatial-Intelligence Agency (NGA), has developed precise positioning software that uses dual frequency GPS carrier phase and pseudorange data to obtain 2-3 centimeter level positioning accuracy for a single static receiver. The paper describes the design of the algorithm, its implemen...
متن کاملKalman Filtering, Factor Graphs and Electrical Networks
Abstract Factor graphs are graphical models with origins in coding theory. It is well known that Kalman filtering is an instance of the generic sum(mary)-product algorithm on the corresponding factor graph. In this paper, a one-to-one correspondence between such factor graphs and a class of electrical networks is presented. The electrical network “computes” correct Bayesian estimates even for f...
متن کاملFast Bayesian reconstruction of chaotic dynamical systems via extended Kalman filtering.
We present an improved Markov chain Monte Carlo (MCMC) algorithm for posterior computation in chaotic dynamical systems. Recent Bayesian approaches to estimate the parameters of chaotic maps have used the Gibbs sampler which exhibits slow convergence due to high posterior correlations. Using the extended Kalman filter to compute the likelihood function by integrating out all unknown system stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks
سال: 2001
ISSN: 1045-9227
DOI: 10.1109/72.914520